package leetcode;

/**
 * @author Liangyaoyun
 */
public class leetCode509 {
    public int fib(int n) {
        int[] dp=new int[n+1];
        if (n==0||n==1){
            return 0;
        }
        dp[0]=0;
        dp[1]=1;
        for (int i = 2; i <=n ; i++) {
            dp[i]=dp[i-1]+dp[i-2];
        }
        return dp[n];
    }

    public static void main(String[] args) {
        leetCode509 leetCode509=new leetCode509();
        leetCode509.fib(4);
    }
}
